Restricted matching in graphs of small genus
نویسندگان
چکیده
منابع مشابه
Matching Integral Graphs of Small Order
In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...
متن کاملGraphs with restricted valency and matching number
Consider the family of all finite graphs with maximum degree ∆(G) < d and matching number ν(G) < m. In this paper we give a new proof to obtain the exact upper bound for the number of edges in such graphs and also characterize all the cases when the maximal graph is unique. We also provide a new proof of Gallai’s lemma concerning factor critical graphs.
متن کامل0 On the restricted matching of graphs in surfaces ∗
A connected graph G with at least 2m + 2n + 2 vertices is said to have property E(m,n) if, for any two disjoint matchings M and N of size m and n respectively, G has a perfect matching F such that M ⊆ F and N ∩ F = ∅. In particular, a graph with E(m, 0) is m-extendable. Let μ(Σ) be the smallest integer k such that no graphs embedded on a surface Σ are k-extendable. Aldred and Plummer have prove...
متن کاملSpace Complexity of Perfect Matching in Bounded Genus Bipartite Graphs
We investigate the space complexity of certain perfect matching problems over bipartite graphs embedded on surfaces of constant genus (orientable or non-orientable). We show that the problems of deciding whether such graphs have (1) a perfect matching or not and (2) a unique perfect matching or not, are in the logspace complexity class SPL. Since SPL is contained in the logspace counting classe...
متن کاملDetermining All Maximum Uniquely Restricted Matching in Bipartite Graphs
The approach mapping from a matching of bipartite graphs to digraphs has been successfully used for forcing set problem, in this paper, it is extended to uniquely restricted matching problem. We show to determine a uniquely restricted matching in a bipartite graph is equivalent to recognition a acyclic digraph. Based on these results, it proves that determine the bipartite graphs with all maxim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2008
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.11.001